A revised reformulation-linearization technique for the quadratic assignment problem
نویسندگان
چکیده
منابع مشابه
A Lower Bound for the Quadratic Assignment Problem Based on a Level-2 Reformulation-Linearization Technique
This paper should be of interest to the combinatorial optimization community and especially to those interested in the Quadratic Assignment Problem (QAP). The QAP has application in the assignment of facilities to locations (to minimize the cost of intrafacility transportation), the placement of electronic components (to minimize the length of interconnecting wire), the placement of blades in a...
متن کاملA level-2 reformulation-linearization technique bound for the quadratic assignment problem
This paper studies polyhedral methods for the quadratic assignment problem. Bounds on the objective value are obtained using mixed 0–1 linear representations that result from a reformulation–linearization technique (rlt). The rlt provides different “levels” of representations that give increasing strength. Prior studies have shown that even the weakest level-1 form yields very tight bounds, whi...
متن کاملA Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
We apply the level-3 Reformulation Linearization Technique (RLT3) to the Quadratic Assignment Problem (QAP). We then present our experience in calculating lower bounds using an essentially new algorithm, based on this RLT3 formulation. This algorithm is not guaranteed to calculate the RLT3 lower bound exactly, but approximates it very closely and reaches it in some instances. For Nugent problem...
متن کاملAlgorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique
In this paper, we propose two exact algorithms for the GQAP (generalized quadratic assignment problem). In this problem, given M facilities and N locations, the facility space requirements, the location available space, the facility installation costs, the flows between facilities, and the distance costs between locations, one must assign each facility to exactly one location so that each locat...
متن کاملA New Branch-and-Bound Solver for the Quadratic Assignment Problem Based on the Level-3 Reformulation-Linearization Technique
We report on the implementation of a level-3 reformulation linearization technique (RLT-3)-based bound calculation in a branch-and-bound algorithm. The RLT-3-based bound calculation method is not guaranteed to calculate the RLT-3 lower bound exactly, but approximates it very closely and reaches it in some instances. We tested the new branch-andbound solver on six Nugent instances, 15, 18, 20, 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2014
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2014.08.003